Latch Inference for Equivalence Checking
نویسنده
چکیده
A method for inferring latches from combinational loops in a netlist using boolean equations is proposed in this paper. The method takes advantage of the solutions structure of the latch loop boolean equation that allows us to obtain a phase and permutation independent procedure for latch inference. This method allows a better latch matching in equivalence checking tools.
منابع مشابه
Design and Verification of an ATM Knockout Switch Concentrator
In this paper we describe the design and verification of the concentrator of a Knockout ATM (Asynchronous Transfer Mode) switch fabric using the VIS tool. The Knockout is a popular ATM switch fabric which has application in both datagram and virtual circuit packet networks. The concentrator is the most difficult component in the Knockout ATM switch fabric. We developed an RTL structural design ...
متن کاملEffective use of SMT solvers for Program Equivalence Checking through Invariant Sketching and Query Decomposition
Program equivalence checking is a fundamental problem in computer science with applications to translation validation and automatic synthesis of compiler optimizations. Modern equivalence checkers employ SMT solvers to discharge proof obligations generated by their equivalence checking algorithm. Equivalence checkers also involve algorithms to infer invariants that relate the intermediate state...
متن کاملCoastal Water Level Prediction Model Using Adaptive Neuro-fuzzy Inference System
This paper employs Adaptive Neuro-Fuzzy Inference System (ANFIS) to predict water level that leads to flood in coastal areas. ANFIS combines the verbal power of fuzzy logic and numerical power of neural network for its action. Meteorological and astronomical data of Santa Monica, a coastal area in California, U. S. A., were obtained. A portion of the data was used to train the ANFIS network, wh...
متن کاملTowards Implementations for Advanced Equivalence Checking in Answer-Set Programming
In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different notions of equivalence, including the well-known notions of strong and uniform equivalence, as well as refined equivalence notions based on the projection of answer sets, where not all parts of an answer set are of relevance (like, ...
متن کاملType Checking and Inference Are Equivalent in Lambda Calculi with Existential Types
This paper shows that type-checking and type-inference problems are equivalent in domain-free lambda calculi with existential types, that is, type-checking problem is Turing reducible to typeinference problem and vice versa. In this paper, the equivalence is proved for two variants of domain-free lambda calculi with existential types: one is an implication and existence fragment, and the other ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007